Quantum Algorithm for Distributed Clock Synchronization
نویسندگان
چکیده
منابع مشابه
Quantum algorithm for distributed clock synchronization
The clock synchronization problem is to determine the time difference Delta between two spatially separated clocks. When message delivery times between the two clocks are uncertain, O(2(2n)) classical messages must be exchanged between the clocks to determine n digits of Delta. On the other hand, as we show, there exists a quantum algorithm to obtain n digits of Delta while communicating only O...
متن کاملAn Election Algorithm for a Distributed Clock Synchronization Program
This paper describes the election algorithm that guarantees the reliability of TEMPO, a distributed clock synchronizer running on Berkeley UNIX 7 4.3BSD systems. TEMPO is a distributed program based on a master-slave scheme that is comprised of time daemon processes running on individual machines. The election algorithm chooses a new master from among the slaves after the crash of the machine o...
متن کاملPrecise Clock Synchronization Algorithm for Distributed Control Systems
The distributed control systems are applied widely in communication, navigation and power fields. With growing in both systems complexity and speed of data exchange, the real time performance of systems is required. Existing clock synchronization techniques include those for wide-area network (WAN) applications with large propagation delays, e.g., the Network Time Protocol (NTP), and those for ...
متن کاملLayered interactive convergence for distributed clock synchronization
A clock synchronization service ensures that spatially dispersed and heterogeneous processors in a distributed system share a common notion of time. In order to behave as a single, unified computing resource, distributed systems have need for a fault-tolerant, clock synchronization service. One approach employs the interactive convergence (ICV) method, which is both fully distributed and inhere...
متن کاملFast distributed smoothing for network clock synchronization
We consider the problem of estimating node variables from noisy relative measurements in a wireless network. In previous work, a distributed smoothing scheme was developed based on the Jacobi algorithm for obtaining leastsquares (LS) estimates. Although the synchronous version of the algorithm was shown to converge exponentially to the optimal estimate, an analysis of the asynchronous scheme is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2000
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.85.2006